Independent sets in the discrete hypercube
نویسنده
چکیده
We describe a proof of A. Sapozhenko that the number of independent sets in the discrete d-dimensional hypercube Qd is asymptotically 2 √ e22 d−1 as d tends to infinity.
منابع مشابه
Maximal independent sets in the covering graph of the cube
Several familiar problems in extremal set theory can be cast as questions about the maximum possible size of an independent set defined on a suitable graph, about the total number of independent sets in such graphs, or about enumeration of the maximal independent sets. Here we find bounds on the number of maximal independent sets in the covering graph of a hypercube. © 2010 Elsevier B.V. All ri...
متن کاملA Threshold Phenomenon for Random Independent Sets in the Discrete Hypercube
Let I be an independent set drawn from the discrete d-dimensional hypercube Qd = {0, 1}d according to the hard-core distribution with parameter λ > 0 (that is, the distribution in which each set I is chosen with probability proportional to λ|I|). We show a sharp transition around λ = 1 in the appearance of I: for λ > 1, min{|I∩E|, |I∩O|} = 0 almost surely, where E andO are the bipartition class...
متن کاملDecomposing the hypercube Qn into n isomorphic edge-disjoint trees
We show that the edge set of the n-dimensional hypercube Qn is the disjoint union of the edge sets of n isomorphic trees.
متن کاملFinding independent sets in a graph using continuous multivariable polynomial formulations
Two continuous formulations of the maximum independent set problem on a graph G = (V ,E) are considered. Both cases involve the maximization of an n-variable polynomial over the n-dimensional hypercube, where n is the number of nodes in G. Two (polynomial) objective functions F(x) and H(x) are considered. Given any solution to x0 in the hypercube, we propose two polynomial-time algorithms based...
متن کاملA note on balanced independent sets in the cube
Ramras conjectured that the maximum size of an independent set in the discrete cube Qn containing equal numbers of sets of even and odd size is 2n−1 − ( n−1 (n−1)/2 ) when n is odd. We prove this conjecture, and find the analogous bound when n is even. The result follows from an isoperimetric inequality in the cube. The discrete hypercube Qn is the graph with vertices the subsets of [n] = {1, ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006